On the Integrated Scheduling of Hardkill and Softkill Assets Using Dynamic Programming

نویسنده

  • Douglas W. Oard
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method to Optimize Ship Maneuvers for the Coordination of Hardkill and Softkill Weapons within a Frigate

The coordination of anti-air warfare hardkill and softkill weapon systems is an important aspect of command and control for a Frigate. Since the effectiveness of a particular weapon varies depending on the orientation of the Frigate with respect to the threats faced, a key element of the coordination process is to maneuver the Frigate to most effectively use all the weapons available. This pape...

متن کامل

Integrated Due Date Setting and Scheduling on a Single Machine Considering an Unexpected Unavailability

In this paper, an integrated machine scheduling withits due date setting problem has been considered. It is assumed that the machine is subject to some kind of random unavailability. Due dates should be set in an attractive and reliable manner, implying that they should be short and possible to be met. To this end, first, long due dates are penalized in the objective function. Then, for each cu...

متن کامل

Coordinating Plans for Agents Performing AAW Hardkill and Softkill for Frigates

The coordination of anti-air warfare (AAW) hardkill (HK) and softkill (SK) weapon systems is an important aspect of command and control for the HALIFAX Class Frigate. This led to the development of a rapid prototyping environment, described here, which supports the investigation of methods to coordinate the plans produced by AAW HK and SK agents. The HK and SK planning agents are described. An ...

متن کامل

Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment

This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

متن کامل

Dynamic Cargo Trains Scheduling for Tackling Network Constraints and Costs Emanating from Tardiness and Earliness

This paper aims to develop a multi-objective model for scheduling cargo trains faced by the costs of tardiness and earliness, time limitations, queue priority and limited station lines. Based upon the Islamic Republic of Iran Railway Corporation (IRIRC) regulations, passenger trains enjoy priority over other trains for departure. Therefore, the timetable of cargo trains must be determined based...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993